QDist--quartet distance between evolutionary trees
نویسندگان
چکیده
منابع مشابه
QDist-quartet distance between evolutionary trees
SUMMARY QDist is a program for computing the quartet distance between two unrooted trees, i.e. the number of quartet topology differences between the trees, where a quartet topology is the topological subtree induced by four species. The program is based on an algorithm with running time O(n log2 n), which makes it practical to compare large trees. Available under GNU license. AVAILABILITY ht...
متن کاملComputing the Quartet Distance Between Evolutionary Trees of Bounded Degree
We present an algorithm for calculating the quartet distance between two evolutionary trees of bounded degree on a common set of n species. The previous best algorithm has running time O(d2n2) when considering trees, where no node is of more than degree d. The algorithm developed herein has running time O(d9n log n)) which makes it the first algorithm for computing the quartet distance between ...
متن کاملOn the maximum quartet distance between phylogenetic trees
A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on n leaves is at most ( 23 + o(1)) ( n 4 ) . Using the machinery of flag algebras we improve the currently known bounds regarding this conjecture, in particular we show that the maximum is at most (0.69 + o(1)) ( n 4 ) . We also give further evidence that the conjecture is true by prov...
متن کاملComputing the Quartet Distance Between Trees of Arbitrary Degrees
Comparing trees with regard to their topology is in itself an interesting theoretical problem in computer science, and furthermore researchers working in the interdisciplinary field of computational biology need tools to compare phylogenetic trees, i.e. trees that describe the relation of species according to evolutionary history. Different methods and different information can result in differ...
متن کاملComputing the Quartet Distance Between Trees of Arbitrary Degree
We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number of quartets—sub-trees induced by four leaves—that differs between the trees. Previous algorithms focus on computing the quartet distance between binary trees. In this paper, we present two algorithms for computing the quartet ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2004
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/bth097